A deterministic multivariate interpolation algorithm for small finite fields
نویسندگان
چکیده
منابع مشابه
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show that it is possible to find an n-variable interpolating polynomial with at most t terms, using the number of field operations that is polynomial in t and n. The algorithm exploits the structure of the multivariate gen...
متن کاملA Smooth Multivariate Interpolation Algorithm
This brief paper introduces an algorithm for smooth interpolation of a multivariate function. The input data for the algorithm consists of a set of function values and derivatives up to order r on a finite set of points E. The algorithm utilizes the Voronoi diagram of E to construct a partition of unity that isolates the points of E. Averaging locally defined functions with the partition of uni...
متن کاملQuantum algorithm for multivariate polynomial interpolation
How many quantum queries are required to determine the coefficients of a degree-d polynomial in n variables? We present and analyse quantum algorithms for this multivariate polynomial interpolation problem over the fields [Formula: see text], [Formula: see text] and [Formula: see text]. We show that [Formula: see text] and [Formula: see text] queries suffice to achieve probability 1 for [Formul...
متن کاملFast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
The authors consider the problem of reconstructing (i.e., interpolating) a t-sparse multivariate polynomial given a black box which will produce the value of the polynomial for any value of the arguments. It is shown that, if the polynomial has coefficients in a finite field GF[q] and the black box can evaluate the polynomial in the field GF[qr2g,tnt+37], where n is the number of variables, the...
متن کاملA new algorithm for sparse interpolation of multivariate polynomials
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser’s qd-algorithm, inwhichwe overcome both drawbacks. © 2008 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2002
ISSN: 0018-9340
DOI: 10.1109/tc.2002.1032628